Graph-based Exploration of Non-graph Datasets

نویسندگان

  • Udayan Khurana
  • Srinivasan Parthasarathy
  • Deepak S. Turaga
چکیده

Graphs or networks provide a powerful abstraction to view and analyze relationships among different entities present in a dataset. However, much of the data of interest to analysts and data scientists resides in non-graph forms such as relational databases, JSON, XML, CSV and text. The effort and skill required in identifying and extracting the relevant graph representation from data is often the prohibitive and limits a wider adoption of graph-based analysis of nongraph data. In this paper, we demonstrate our system called GraphViewer, for accelerated graph-based exploration and analysis. It automatically discovers relevant graphs implicit within a given non-graph dataset using a set of novel rulebased and data-driven techniques, and optimizes their extraction and storage. It computes several node and graph level metrics and detects anomalous entities in data. Finally, it summarizes the results to support interpretation by a human analyst. While the system automates the computationally intensive aspects of the process, it is engineered to leverage human domain expertise and instincts to fine tune the data exploration process.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Effective Method for Utility Preserving Social Network Graph Anonymization Based on Mathematical Modeling

In recent years, privacy concerns about social network graph data publishing has increased due to the widespread use of such data for research purposes. This paper addresses the problem of identity disclosure risk of a node assuming that the adversary identifies one of its immediate neighbors in the published data. The related anonymity level of a graph is formulated and a mathematical model is...

متن کامل

Deciding Graph non-Hamiltonicity via a Closure Algorithm

We present a matching and LP based heuristic algorithm that decides graph non-Hamiltonicity. Each of the n! Hamilton cycles in a complete directed graph on n + 1 vertices corresponds with each of the n! n-permutation matrices P, such that pu,i = 1 if and only if the ith arc in a cycle enters vertex u, starting and ending at vertex n + 1. A graph instance (G) is initially coded as exclusion set ...

متن کامل

On the commuting graph of non-commutative rings of order $p^nq$

Let $R$ be a non-commutative ring with unity. The commuting graph of $R$ denoted by $Gamma(R)$, is a graph with vertex set $RZ(R)$ and two vertices $a$ and $b$ are adjacent iff $ab=ba$. In this paper, we consider the commuting graph of non-commutative rings of order pq and $p^2q$ with Z(R) = 0 and non-commutative rings with unity of order $p^3q$. It is proved that $C_R(a)$ is a commutative ring...

متن کامل

Epileptic seizure detection based on The Limited Penetrable visibility graph algorithm and graph properties

Introduction: Epileptic seizure detection is a key step for both researchers and epilepsy specialists for epilepsy assessment due to the non-stationariness and chaos in the electroencephalogram (EEG) signals. Current research is directed toward the development of an efficient method for epilepsy or seizure detection based the limited penetrable visibility graph (LPVG) algorith...

متن کامل

Providing a Link Prediction Model based on Structural and Homophily Similarity in Social Networks

In recent years, with the growing number of online social networks, these networks have become one of the best markets for advertising and commerce, so studying these networks is very important. Most online social networks are growing and changing with new communications (new edges). Forecasting new edges in online social networks can give us a better understanding of the growth of these networ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • PVLDB

دوره 9  شماره 

صفحات  -

تاریخ انتشار 2016